Efficient Refinement Checking in VCC
نویسندگان
چکیده
We propose a methodology for carrying out refinement proofs across declarative abstract models and concrete implementations in C, using the VCC verification tool. Themain idea is to first perform a systematic translation from the top-level abstract model to a ghost implementation in VCC. Subsequent refinement proofs between successively refined abstract models and between abstract and concrete implementations are carried out in VCC. We propose an efficient technique to carry out these refinement checks inVCC.We illustrate ourmethodologywith a case study in which we verify a simplified C implementation of an RTOS scheduler, with respect to its abstract Z specification. Overall, ourmethodology leads to efficient and automatic refinement proofs for complex systems that would typically be beyond the capability of tools such as Z/Eves or Rodin.
منابع مشابه
C/C++ Based System Design Flow Using SpecC, VCC and SystemC
This report presents a C/C++ based system design flow that uses SpecC, VCC and SystemC tools. The design starts with a pure C model that is then converted into a SpecC model. A so-called behavior exploration task then takes place to analyze and optimize the system behavior. We then perform architectural exploration using VCC. Once this is complete, the behavior model is refined to an architectu...
متن کاملConsistency Checking in Early Software Product Line Specifications - The VCC Approach
Software Product Line Engineering (SPLE) is a successful paradigm to produce a family of products for a specific domain. A challenge in SPLE is to check that different models used in early SPL specification do not contain inconsistent information that may be propagated and generate inconsistent products that do not conform to its requirements. This challenge is difficult to address due to the h...
متن کاملEfficient Reachability Analysis and Refinement Checking of Timed Automata Using BDDs
For the formal specification and verification of real-time systems we use the modular formalism Cottbus Timed Automata (CTA), which is an extension of timed automata [AD94]. Matrix-based algorithms for the reachability analysis of timed automata are implemented in tools like Kronos, Uppaal, HyTech and Rabbit. A new BDD-based version of Rabbit, which supports also refinement checking, is now ava...
متن کاملCombining Formal Refinement and Model Checking for Real-Time Systems Verification
We present a framework which combines model checking and theorem prover based refinement for the design of real-time systems focusing on the refinement step when annotating the state-oriented model with timing information. Our verification flow starts from a cycle-accurate finite state machine for the RAVEN model checker and present a translation which efficiently transforms the model to the B ...
متن کاملDetection of land cover changes using MODIS 250 m data
The Vegetative Cover Conversion (VCC) product is designed to serve as a global alarm for land cover change caused by anthropogenic activities and extreme natural events. MODIS 250 m surface reflectance data availability was limited both spatially and temporally in the first year after launch due to processing system constraints. To address this situation, the VCC algorithms were applied to avai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014